package BinaryTree;


public class PreOrderTraverse {

	public static void main(String[] args) {
		BinaryTreeNode node1=new BinaryTreeNode(1);
		BinaryTreeNode node2=new BinaryTreeNode(2);
		BinaryTreeNode node3=new BinaryTreeNode(3);
		BinaryTreeNode node4=new BinaryTreeNode(4);
		BinaryTreeNode node5=new BinaryTreeNode(5);
		BinaryTreeNode node6=new BinaryTreeNode(6);
		BinaryTreeNode node7=new BinaryTreeNode(7);
		node1.left=node2;
		node1.right=node3;
		node2.left=node4;
		node2.right=node5;
		node3.left=node6;
		node3.right=node7;
		node4.left=node4.right=null;
		node5.left=node4.right=null;
		node6.left=node4.right=null;
		node7.left=node4.right=null;
		preOrderTraverse(node1);
	}
	public static void preOrderTraverse(BinaryTreeNode root){
		if(root==null){
			return;
		}
		System.out.println(root.value);
		preOrderTraverse(root.left);
		preOrderTraverse(root.right);
	}

}
